MBP: a Model Based Planner

The Model Based Planner (MBP) is a system for planning in non-deterministic domains. It can generate plans automatically to solve various planning problems, like conformant planning, planning under partial observability, and planning for temporally extended goals. Moreover, MBP can validate plans, and offers a variety of simulation functionalities for plans and domains. MBP is based on Symbolic Model Checking techniques, and Binary Decision Diagrams (BDDs), that provide a practical solution to the problem of dealing with the large size of realistic planning problems. Experimental analysis in the course of the last years has shown MBP to be state-of-the-art in planning for nondeterministic domains. The demo aims at showing MBP’s array of functionalities for plan generation, validation and simulation over an increasingly complex navigation problem.